Research Cell: An International Journal of Engineering Sciences

Akashdeep Kaur ¹, Shaveta Rani ¹, Paramjeet Singh ¹

Affiliations
1 GZS PTU Campus, Bathinda, IN

Abstract

Segmentation is one of the important steps of character recognition system. It is an important step because inaccurate segmentation of characters will cause errors in the recognition stage. In optical character Recognition (OCR) system the presence of touching characters decreases the accuracy rate of character recognition. Touching of half character or full character with other full character makes the character segmentation very challenging or difficult task. In this paper, the method of segmentation for touching characters of handwritten Punjabi text that is the Gurumukhi script has been proposed. The main purpose of this paper is to provide the new segmentation technique based on clustering technique for touching characters.

Keywords

Segmentation, Feature Extraction, Binarization, Classification, Proposed Work, Results.

Full Text

   

Nancy Goyal ¹, Paramjeet Singh ¹

Affiliations
1 Computer Science and Engineering Department, Giani Zail Singh PTU Campus, Bathinda, IN

Abstract

The travelling salesman problem (TSP) is a nondeterministic Polynomial hard problem in combinatorial optimization studied in theoretical computer science and operations research. And to solve this problem we used two popular meta-heuristics method that used for optimization techniques; the first one is Ant Colony Optimization (ACO), and the second is Genetic Algorithm (GA). In this work, we try to apply both techniques to solve TSP by using the same dataset and compare between them to determine the best one for travelling salesman problem.

Keywords

Ant Colony Optimization, Genetic Algorithm, Travelling Salesman Problem, Wireless Sensor Networks.

Full Text

   

Shagufi Singla ¹, Paramjeet Singh ¹

Affiliations
1 Computer Science Engineering Department, GZS-PTU Campus, Bathinda, IN

Abstract

In sensor networks, coverage problem is a critical issue as it is an important aspect in measuring the quality of service (QoS) of the wireless sensor networkin this paper; we introduce a new algorithm in a sensor network to optimize coverage using deployment strategies and particle swarm optimization (PSO). PSO is carried out to find the optimal deployment of the sensor nodes that gives the best coverage.The optimization algorithms are search technique where our aim is to search for an optimal solution to a problem in order to achieve one or more objectives. In this paper we are trying to minimize the coverage holes and maximize the coverage area.

Keywords

Wireless sensor Network, Particle Swarm Optimization, Voronoi Diagram, Gird, Coverage Problem.

Full Text

   

Meena Bharti ¹, Shaveta Rani ², Paramjeet Singh ²

Affiliations
1 PTU Jalandhar, Bathinda, Punjab, IN
2 CSE Department, GZS, PTU Campus, Bathinda, Punjab, IN

Abstract

Networks have flourished due to the advent of new technology. There is a mushroom growth in technology and day to day needs for communication which was never experienced before. A Mobile Ad hoc Network (MANET) is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies. People and vehicles can be internetwork in areas without a preexisting communication infrastructure or when the use of such infrastructure requires wireless extension. Various attacks needed to be detected on order to secure the wireless ad-hoc network. In this paper we are discussing various active attacks.

Keywords

MANET, Network Security, Active Attacks, Rushing Attack, Balckhole attack, Neighbor Attack, Sink Hole Attack.

Full Text